Message-Passing Decoding on Self-dual F4-additive Codes

In this thesis we work with message-passing decoding on self-dual F4-additive codes. We present and disprove the a decoding scheme proposed by Parker et al. in an unpublished manuscript [17]. We refer to this scheme as Embedded Factor Graph decoding. The method of Discriminative decoding is developed and described in this work as a replacement for the embedded decoding. It is shown to be exact for trees. We implement a simulation tool for simulating message-passing decoding. The tool can simulate both the embedded decoding and the discriminative decoding. Some results from executing simulations on trees and graph with cycles are presented.